Recover plaintext attack to block ciphers
نویسنده
چکیده
In this paper, we will present an estimation for the upper-bound of the amount of 16-bytes plaintexts for English texts, that is not sufficient large make clear that the block ciphers with block length no more than 16-bytes will be subject to recover plaintext attacks in the occasions of plaintext -known or plaintext-chosen attacks.
منابع مشابه
A Critique of BEAR and LION
The paper \Two Practical and Provably Secure Block Ciphers: BEAR and LION" AnBi96] by Ross Anderson and Eli Biham is summarized. The paper presents two new block ciphers (BEAR and LION) which can be built using a hash function and a stream cipher. Both these ciphers are provably secure in that a successful attack on them can be used as an attack on the underlying hash function and stream cipher...
متن کاملIntegral Cryptanalysis and Higher Order Differential Attack
Integral cryptanalysis and higher order differential attack are chosen(or known) plaintext attacks on block ciphers. These attacks have been developed independently and become widely used as strong tools to analyze the security of block ciphers. In this paper, basic idea of these attacks including brief historical comments is described. We give some recent applications of integral cryptanalysis...
متن کاملProbabilistic Slide Cryptanalysis and Its Applications to LED-64 and Zorro
This paper aims to enhance the application of slide attack which is one of the most well-known cryptanalysis methods using selfsimilarity of a block cipher. The typical countermeasure against slide cryptanalysis is to use round-dependent constants. We present a new probabilistic technique and show how to overcome round-dependent constants in a slide attack against a block cipher based on the ge...
متن کاملThe Biryukov-Demirci Attack on IDEA and MESH Ciphers
This report elaborates on an observation by Alex Biryukov on the computational graph of the IDEA cipher, and combines it with Demirci’s attack presented at SAC’2002. Further, this attack is also applied to reduced-round versions of the MESH block ciphers. Particular features of these attacks are: (i) they require only known-plaintext (such as in linear cryptanalysis); (ii) they trade-off the nu...
متن کاملLinks between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities
The mere number of various apparently different statistical attacks on block ciphers has raised the question about their relationships which would allow to classify them and determine those that give essentially complementary information about the security of block ciphers. While mathematical links between some statistical attacks have been derived in the last couple of years, the important lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0807.3383 شماره
صفحات -
تاریخ انتشار 2008